Modified Dijkstra Shortest Path Algorithm for SD Networks

This paper uses a modified Dijkstra shortest path method for considering cumulative delays rather than bandwidth in software-defined networks. To implement the proposed method, an open-source Ryu controller is used, and Mininet tool used to emulate topology. The compared with traditional Dijkstra’s algorithm demonstrate its performance. comparison shows that provides higher performance of different delays. Several experiments were conducted evaluate using three parameters (bandwidth, transfer rate jitter). In addition, distribution function calculated show through experiment period.